Mechanical Generation of Admissible Heuristics
نویسندگان
چکیده
منابع مشابه
Admissible Moves in Two-Player Games
Some games have abstract properties that can be used to design admissible heuristics on moves. These admissible heuristics are useful to speed up search. They work well with depth-bounded search algorithms such as Gradual Abstract Proof Search that select moves based on the distance to the goal. We analyze the benefits of these admissible heuristics on moves for rules generation and search. We ...
متن کاملSpecialization of Admissible Path-finding Heuristics
Automatic program generation using logic programming can be used to improve existing problem solving programs. An important class of problems in AI are optimal path-finding problems. These problems are usually solved using the IDA* algorithm with an admissible heuristic. An heuristic is admissible if it never overestimates the cost of solving a problem. An admissible heuristic is better than an...
متن کاملLearning Admissible Heuristics while Solving Problems
A method is presented that causes A* to return high quality solutions whi le solving a set of problems using a non-admissible heuristic. The heuristic gu id ing the search changes as new informat ion is learned dur ing the search, and it converges to an admissible heuristic wh ich 'contains the insight ' of the or ig ina l nonadmissible one. After a finite number of problems, A * returns only o...
متن کاملhm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm
The hm (m = 1, . . .) family of admissible heuristics for STRIPS planning with additive costs generalise the h heuristic, which results when m = 1. We show that the step from h to hm can be made by changing the planning problem instead of the heuristic function. This furthers our understanding of the hm heuristic, and may inspire application of the same generalisation to admissible heuristics s...
متن کاملGenerating Effective Project Scheduling Heuristics by Abstraction and Reconstitution
A project scheduling problem consists of a finite set of jobs, each with fixed integer duration, requiring one or more resources such as personnel or equipment, and each subject to a set of precedence relations, which specify allowable job orderings, and a set of mutual exclusion relations, which specify jobs that cannot overlap. No job can be interrupted once started. The objective is to minim...
متن کامل